Push and Rotate: a Complete Multi-agent Pathfinding Algorithm
نویسندگان
چکیده
منابع مشابه
Push and Rotate: a Complete Multi-agent Pathfinding Algorithm
Multi-agent Pathfinding is a relevant problem in a wide range of domains, for example in robotics and video games research. Formally, the problem considers a graph consisting of vertices and edges, and a set of agents occupying vertices. An agent can only move to an unoccupied, neighbouring vertex, and the problem of finding the minimal sequence of moves to transfer each agent from its start lo...
متن کاملPush and rotate: cooperative multi-agent path planning
In cooperative multi-agent path planning, agents must move between start and destination locations and avoid collisions with each other. Many recent algorithms require some sort of restriction in order to be complete, except for the Push and Swap algorithm [7], which claims only to require two unoccupied locations in a connected graph. Our analysis shows, however, that for certain types of inst...
متن کاملA Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding
Multi-agent pathfinding, where multiple agents must travel to their goal locations without getting stuck, has been studied in both theoretical and practical contexts, with a variety of both optimal and sub-optimal algorithms proposed for solving problems. Recent work has shown that there is a lineartime check for whether a multi-agent pathfinding problem can be solved in a tree, however this wa...
متن کاملICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding
Conflict-Based Search (CBS) and its enhancements, Meta-Agent CBS and bypassing conflicts are amongst the strongest newly introduced algorithms for Multi-Agent Path Finding. This paper introduces two new improvements to CBS and incorporates them into a coherent, improved version of CBS, namely ICBS. Experimental results show that each of these improvements further reduces the runtime over the ex...
متن کاملOptimal Multi-Agent Pathfinding Algorithms
The multi-agent path finding (MAPF) problem is a generalization of the single-agent path finding problem for k > 1 agents. It consists of a graph and a number of agents. For each agent, a unique start state and a unique goal state are given, and the task is to find paths for all agents from their start states to their goal states, under the constraint that agents cannot collide during their mov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2014
ISSN: 1076-9757
DOI: 10.1613/jair.4447